Eliciting Structural and Semantic Global Knowledge in Unsupervised Graph Contrastive Learning
نویسندگان
چکیده
Graph Contrastive Learning (GCL) has recently drawn much research interest for learning generalizable node representations in a self-supervised manner. In general, the contrastive process GCL is performed on top of learned by graph neural network (GNN) backbone, which transforms and propagates contextual information based its local neighborhoods. However, nodes sharing similar characteristics may not always be geographically close, poses great challenge unsupervised efforts due to their inherent limitations capturing such global knowledge. this work, we address proposing simple yet effective framework -- Simple Neural Networks with Structural Semantic Learning} (S^3-CL). Notably, virtue proposed structural semantic algorithms, even can learn expressive that preserve valuable patterns. Our experiments demonstrate S^3-CL) achieve superior performance different downstream tasks compared state-of-the-art methods. Implementation more experimental details are publicly available at https://github.com/kaize0409/S-3-CL.
منابع مشابه
Unsupervised Feature Extraction by Time-Contrastive Learning and Nonlinear ICA
Nonlinear independent component analysis (ICA) provides an appealing framework for unsupervised feature learning, but the models proposed so far are not identifiable. Here, we first propose a new intuitive principle of unsupervised deep learning from time series which uses the nonstationary structure of the data. Our learning principle, time-contrastive learning (TCL), finds a representation wh...
متن کاملJoint Semantic Relevance Learning with Text Data and Graph Knowledge
Inferring semantic relevance among entities (e.g., entries of Wikipedia) is important and challenging. According to the information resources, the inference can be categorized into learning with either raw text data, or labeled text data (e.g., wiki page), or graph knowledge (e.g, WordNet). Although graph knowledge tends to be more reliable, text data is much less costly and offers a better cov...
متن کاملUnsupervised Semantic Role Induction with Graph Partitioning
In this paper we present a method for unsupervised semantic role induction which we formalize as a graph partitioning problem. Argument instances of a verb are represented as vertices in a graph whose edge weights quantify their role-semantic similarity. Graph partitioning is realized with an algorithm that iteratively assigns vertices to clusters based on the cluster assignments of neighboring...
متن کاملUnsupervised Learning of Semantic Mappings
We discuss the feasibility of the following learning problem: given unmatched samples from two domains and nothing else, learn a mapping between the two, which preserves semantics. Due to the lack of paired samples and without any definition of the semantic information, the problem might seem ill-posed. Specifically, in typical cases, it seems possible to build infinitely many alternative mappi...
متن کاملUnsupervised Learning of Semantic Concepts
Given a large number of articles comprising of natural text we intend to train on the text and extract clusters of words which are semantically related. When I query the system with a word it will return all the words which are very related to the same theme. For example our training set could be all the articles appearing in a magazine. If I query the system with war it would return all the wo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i6.25898